Generalized Weighted Finite Automata Based Image Compression

نویسندگان

  • Karel Culik
  • P. C. von Rosenberg
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Succinct Representations of Textured Surfaces by Weighted Finite Automata

Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and white), grayscaleor color-images and even video sequences can be effectively coded as weighted finite automata. Since each state represents a subimage within those automata the weighted transitions can exploit self-similarit...

متن کامل

Aritmetic Compression of Weighted Finite Automata

Karel Culik and the first author have demonstrated how Weighted Finite Automata (WFA) provide a strong tool for image compression [1, 2, 3, 4]. In the present article we introduce an improved method for the last step of the compression algorithm: for compressing the WFA that approximates the given image. Our method is based on arithmetic compression of sparse matrices.

متن کامل

Better Compression Performance by Compressing Sliced Bit Planes of Image Using Weighted Finite Automata

Weighted Finite Automata (WFA) is an efficient structure for digital image storage and is successfully applied for the image compression purpose. This paper introduces the idea of slicing image into eight bit planes and then compressing each bit planes individually using proposed WFA inference algorithm. Furthermore, the proposed algorithm uses the concept of invertible resolution wise mapping ...

متن کامل

M . Droste and P . Gastin Weighted automata and weighted logics Research Report LSV - 05 - 13 July 2005

Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We generalize Büchi’s and Elgot’s fundamental theorems to this quantitative setting. We introduce a weighted ve...

متن کامل

Generalised Stochastic Automaton Image

It is well known that digital images can be generated by generalised stochastic automata (GSA). This fact has been taken as the basis for image compression by storing a GSA rather than the image that it generates. This paper investigates fundamental relationships between the parameters of GSA and their generated images. In particular, we are interested in expressing the magnitude of GSA weights...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1999